/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86185
 * Date: 2023-04-16
 * Time: 14:34
 */
public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
        binaryTree.preOrder(root);
        System.out.println();
//        System.out.println();
//        binaryTree.inOrder(root);
//        System.out.println();
//        binaryTree.postOrder(root);
//        System.out.println(binaryTree.size(root));
//        System.out.println(binaryTree.size1(root));
//        System.out.println(binaryTree.getLeafNodeCount(root));
//        System.out.println(binaryTree.getKLevelNodeCount(3,root));
//        System.out.println(BinaryTree.getHeight(root));
//        BinaryTree.TreeNode f = binaryTree.find(root, 'Z');
//        System.out.println(f);
//        System.out.println();
//        binaryTree.levelOrder(root);
//        System.out.println(binaryTree.isCompleteTree(root));
        System.out.println();
        binaryTree.preOrder2(root);
//        System.out.println();
//        binaryTree.postOrder2(root);
    }
}
